Edge-Orders
نویسندگان
چکیده
Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying link behind all these orders has been shown that links them to well-known graph decompositions into parts that have a prescribed vertex-connectivity. Despite extensive interest in canonical orderings, no analogue of this unifying concept is known for edge-connectivity. In this paper, we establish such a concept named edge-orders and show how to compute (1,1)-edge-orders of 2-edge-connected graphs as well as (2,1)-edge-orders of 3-edge-connected graphs in linear time, respectively. While the former can be seen as the edge-variants of st-numberings, the latter are the edge-variants of Mondshein sequences and nonseparating ear decompositions. The methods that we use for obtaining such edge-orders differ considerably in almost all details from the ones used for their vertex-counterparts, as different graph-theoretic constructions are used in the inductive proof and standard reductions from edgeto vertex-connectivity are bound to fail. As a first application, we consider the famous Edge-Independent Spanning Tree Conjecture, which asserts that every k-edge-connected graph contains k rooted spanning trees that are pairwise edge-independent. We illustrate the impact of the above edge-orders by deducing algorithms that construct 2and 3-edge independent spanning trees of 2and 3-edge-connected graphs, the latter of which improves the best known running time from O(n2) to linear time. 1998 ACM Subject Classification G.2.2 Graph Theory, Graph Algorithms
منابع مشابه
Characterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
متن کاملTopological Orders and Edge Excitations in FQH States
Fractional quantum Hall (FQH) liquids contain extremely rich internal structures which represent a whole new kind of ordering. We discuss the characterization and classification of the new orders (which is called topological orders). We also discuss the edge excitations in FQH liquids, which form the so-called chiral Luttinger liquids. The chiral Luttinger liquids at the edges also have very ri...
متن کاملRunning Head: DISTRIBUTED ESTIMATION OF GRAPH EDGE-TYPE WEIGHTS
We describe a distributed structural estimation approach for recovering graph edge-type weights that are revealed through orders generated by a specific type of influence propagation, Edge-Type Weighted PageRank. Our implementation combines numerical gradient descent with PageRank iterations using the Pregel framework.
متن کاملANNEGRET K . WAGLER Critical and Anticritical Edges with respect to Perfectness
We call an edge e of a perfect graph G critical if G e is imperfect and call e anticritical if G + e is imperfect. The present paper surveys several questions in this context. We ask in which perfect graphs critical and anticritical edges occur and how to detect such edges. The main result by Hougardy & Wagler [32] shows that a graph does not admit any critical edge if and only if it is Meyniel...
متن کاملAnalog Integrated Circuit for Edge Detection with wide Dynamic Range Based on Vertebrate Outer Retina
An analog circuit for edge detection was proposed based on vertebrate outer retinas. The chip which contained 40× 40 unit circuits in a two-dimensional array was fabricated with 0.35 μm CMOS process. Edge images were experimentally observed in a brightness range over 3 orders of magnitude. It was clarified by simulation with the simulation program with integrated circuit emphasis (SPICE) that a...
متن کامل